collision regulations - tradução para russo
Diclib.com
Dicionário ChatGPT
Digite uma palavra ou frase em qualquer idioma 👆
Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

  • como a palavra é usada
  • frequência de uso
  • é usado com mais frequência na fala oral ou escrita
  • opções de tradução de palavras
  • exemplos de uso (várias frases com tradução)
  • etimologia

collision regulations - tradução para russo

PROPERTY OF CRYPTOGRAPHIC HASH FUNCTIONS
Collision resistant; Collision-resistant

collision regulations      
правила предупреждения столкновений
hash collision         
  • John Smith and Sandra Dee are both being directed to the same cell. Open addressing will cause the hash table to redirect Sandra Dee to another cell.
COMPUTER SCIENCE SITUATION WHERE TWO DATA ELEMENTS SHARE A HASHTAG, CHECKSUM, FINGERPRINT, ETC.
Hash collisions; Hash collision (computer science); Cryptographic hash collision

общая лексика

хэш-коллизия (столкновение, конфликт)

ситуация, когда два различных ключа выбирают ("хэшируют") одно и то же значение, указывают на одну и ту же ячейку в хэш-таблице

синоним

hash clash

Смотрите также

hash function; hash table

inelastic collision         
COLLISION WHERE ENERGY IS LOST TO HEAT, SO THAT KINETIC ENERGY IS NOT CONSERVED
Inelastic interaction; Inelastic interactions; Inelastic Collision; Plastic Collision; Inelastic collisions; Perfectly inelastic collision; Perfectly Inelastic Collision

общая лексика

неупругий удар

Definição

hash collision
<programming> (Or "hash clash") When two different keys hash to the same value, i.e. to the same location in a {hash table}. ESR once asked a friend what he expected Berkeley to be like. The friend replied, "Well, I have this mental picture of naked women throwing Molotov cocktails, but I think that's just a collision in my hash tables." [Jargon File] (1995-01-23)

Wikipédia

Collision resistance

In cryptography, collision resistance is a property of cryptographic hash functions: a hash function H is collision-resistant if it is hard to find two inputs that hash to the same output; that is, two inputs a and b where ab but H(a) = H(b).: 136  The pigeonhole principle means that any hash function with more inputs than outputs will necessarily have such collisions;: 136  the harder they are to find, the more cryptographically secure the hash function is.

The "birthday paradox" places an upper bound on collision resistance: if a hash function produces N bits of output, an attacker who computes only 2N/2 (or 2 N {\displaystyle \scriptstyle {\sqrt {2^{N}}}} ) hash operations on random input is likely to find two matching outputs. If there is an easier method to do this than brute-force attack, it is typically considered a flaw in the hash function.

Cryptographic hash functions are usually designed to be collision resistant. However, many hash functions that were once thought to be collision resistant were later broken. MD5 and SHA-1 in particular both have published techniques more efficient than brute force for finding collisions. However, some hash functions have a proof that finding collisions is at least as difficult as some hard mathematical problem (such as integer factorization or discrete logarithm). Those functions are called provably secure.

Como se diz collision regulations em Russo? Tradução de &#39collision regulations&#39 em Russo